a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
↳ QTRS
↳ DependencyPairsProof
a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
A(a(x1)) → B(b(x1))
B(b(b(b(b(x1))))) → A(x1)
A(a(x1)) → B(b(b(x1)))
B(b(b(b(b(x1))))) → A(a(x1))
B(b(b(b(b(x1))))) → A(a(a(x1)))
A(a(x1)) → B(x1)
a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
A(a(x1)) → B(b(x1))
B(b(b(b(b(x1))))) → A(x1)
A(a(x1)) → B(b(b(x1)))
B(b(b(b(b(x1))))) → A(a(x1))
B(b(b(b(b(x1))))) → A(a(a(x1)))
A(a(x1)) → B(x1)
a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(a(x1)) → B(b(x1))
B(b(b(b(b(x1))))) → A(x1)
B(b(b(b(b(x1))))) → A(a(x1))
B(b(b(b(b(x1))))) → A(a(a(x1)))
A(a(x1)) → B(x1)
Used ordering: Polynomial interpretation [25,35]:
A(a(x1)) → B(b(b(x1)))
The value of delta used in the strict ordering is 99/64.
POL(B(x1)) = 9/4 + (2)x_1
POL(a(x1)) = 1 + (5/2)x_1
POL(A(x1)) = 9/4 + (11/4)x_1
POL(b(x1)) = 1/2 + (7/4)x_1
b(b(b(b(b(x1))))) → a(a(a(x1)))
a(a(x1)) → b(b(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
A(a(x1)) → B(b(b(x1)))
a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))